Factorization-Based Graph Repartitionings

نویسندگان

  • Katerina Jurková
  • Miroslav Tuma
چکیده

The paper deals with the parallel computation of matrix factorization using graph partitioning-based domain decomposition. It is well-known that the partitioned graph may have both a small separator and well-balanced domains but sparse matrix decompositions on domains can be completely unbalanced. In this paper we propose to enhance the iterative strategy for balancing the decompositions from [13] by graph-theoretical tools. We propose the whole framework for the graph repartitioning. In particular, new global and local reordering strategies for domains are discussed in more detail. We present both theoretical results for structured grids and experimental results for unstructured large-scale problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion

For a large class of irregular grid applications the structure of the mesh changes from one phase of the computation to the next Eventually as the graph evolves the adapted mesh has to be reparti tioned to ensure good load balance If this new graph is partitioned from scratch it will lead to an excessive migration of data among processors In this paper we present a new scheme for computing repa...

متن کامل

A Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization

This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...

متن کامل

Graph-Based Factorization of Classical Planning Problems

In domain-independent planning, dependencies of operators and variables often prevent the effective application of planning techniques that rely on “loosely coupled” problems (like factored planning or partial order reduction). In this paper, we propose a generic approach for factorizing a classical planning problem into an equivalent problem with fewer operator and variable dependencies. Our a...

متن کامل

Level-based Incomplete LU Factorization: Graph Model and Algorithms

A graph theoretic process that models level-based, incomplete LU factorization (ILU(`)) of sparse unsymmetric matrices is developed. The model leads to two incomplete fill path theorems that are generalizations of the original fill path theorem of Rose, Tarjan, and Lueker. Our S-level incomplete fill path theorem leads to the development of new, embarrassingly parallel algorithms for computing ...

متن کامل

Parallel Graph Coloring with Applications to the Incomplete-LU Factorization on the GPU

In this technical report we study different parallel graph coloring algorithms and their application to the incomplete-LU factorization. We implement graph coloring based on different heuristics and showcase their performance on the GPU. We also present a comprehensive comparison of level-scheduling and graph coloring approaches for the incomplete-LU factorization and triangular solve. We discu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009